Galois invariance, trace codes and subfield subcodes

نویسندگان

  • Marta Giorgetti
  • Andrea Previtali
چکیده

Article history: Received 26 February 2009 Revised 21 September 2009 Available online 2 February 2010 Communicated by W. Cary Huffman

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On parameters of subfield subcodes of extended norm-trace codes

In this article we describe how to find the parameters of subfield subcodes of extended Norm–Trace codes. With a Gröbner basis of the ideal of the Fqr rational points of the Norm–Trace curve one can determine the dimension of the subfield subcodes or the dimension of the trace code. We also find a BCH–like bound from the minimum distance of the original supercode. AMS Subject Classification: Pr...

متن کامل

A Linear Algebraic Approach to Subfield Subcodes of GRS Codes

The problem of finding subfield subcodes of generalized Reed–Solomon (GRS) codes (i.e., alternant codes) is considered. A pure linear algebraic approach is taken in order to derive message constraints that generalize the well known conjugacy constraints for cyclic GRS codes and their Bose– Chaudhuri–Hocquenghem (BCH) subfield subcodes. It is shown that the presented technique can be used for fi...

متن کامل

Classical and Quantum Evaluation Codes at the Trace Roots

We introduce a new class of evaluation linear codes by evaluating polynomials at the roots of a suitable trace function. Considering subfield-subcodes over the field $\mathbb{F}_4$, we obtain several linear codes which are records at [http://www.codetables.de]. Moreover, we give conditions for self-orthogonality, with respect to Hermitian-inner product, and we construct quantum stabilizer codes...

متن کامل

Quantum codes from affine variety codes and their subfield-subcodes

We use affine variety codes and their subfield-subcodes for obtaining quantum stabilizer codes via the CSS code construction. With this procedure we get codes with good parameters, some of them exceeding the quantum Gilbert-Varshamov bound given by Feng and Ma.

متن کامل

Codes and the Cartier Operator

In this article, we present a new construction of codes from algebraic curves. Given a curve over a non-prime finite field, the obtained codes are defined over a subfield. We call them Cartier Codes since their construction involves the Cartier operator. This new class of codes can be regarded as a natural geometric generalisation of classical Goppa codes. In particular, we prove that a well-kn...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Finite Fields and Their Applications

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2010